例句與造句

1. The backtracking algorithm traverses this search tree depth-first order.
2. Prolog searches the tree depth-first, one branch at a time, using backtracking when it encounters a failure node.
3. The order in which the self-IDs are assigned is equivalent to traversing the tree depth-first, post-order.
4. These include searching the tree depth-first, breadth-first, or best-first using some measure of desirability of solutions.
5. As an example of this, Hall & Greenbergfound that even for a very reflective scene, using this with a maximum depth of 15 resulted in an average ray tree depth of 1.7.
6. It's difficult to find tree depth in a sentence. 用tree depth造句挺難的
7. Some implementations limit the tree depth using hash tree depth prefixes before hashes, so any extracted hash chain is defined to be valid only if the prefix decreases at each step and is still positive when the leaf is reached.
8. Some implementations limit the tree depth using hash tree depth prefixes before hashes, so any extracted hash chain is defined to be valid only if the prefix decreases at each step and is still positive when the leaf is reached.
9. Sokoban is difficult not only due to its branching factor ( which is comparable to chess ), but also its enormous search tree depth; some levels can be extended indefinitely, with each iteration requiring an exponentially growing number of moves and pushes.
10. A suffix tree can be built in \ mathcal { O } ( n ) and can be converted into a suffix array by traversing the tree depth-first also in \ mathcal { O } ( n ), so there exist algorithms that can build a suffix array in \ mathcal { O } ( n ).